One-Shot Operational Quantum Resource Theory

One-Shot Quantum Capacities of Quantum Channels

We study optimal rates for quantum communication over a single use of a channel, which itself can correspond to a finite number of uses of a channel with correlated noise. The corresponding capacity is often referred to as the one-shot capacity. Here, in particular, we consider the protocol in which Alice sends one part of a maximally entangled state through a quantum channel to Bob, who then p...

Operational Quantum Theory; Measurement Theory

Optimal quantum networks and one-shot entropies

We present a general-purpose method for the optimization of quantum networks, including both causal networks and networks with indefinite causal structure. Our method applies to a broad class of performance measures, defined operationally in terms of tests set up by a verifier. We show that the optimal performance can be quantified by the max relative entropy between a suitable operator, associ...

Bounds on one-shot quantum capacities

We consider the protocol in which Alice sends one part of a maximally entangled state through the channel to Bob, who then performs a quantum operation on the received state, with the final objective of obtaining a nearly maximally entangled state, shared with Alice. We evaluate bounds on the one-shot capacity of this protocol in terms of smoothed conditional Rényi entropies. These in turn yiel...

One-shot timer for Resource-Based Earliest Deadline First Scheduler

In a previous research project [5], we found there are several disadvantages of the current Linux scheduler. So we employed a alternative scheduler, Resource-Based Earliest Deadline First scheduler(RB-EDF), to solve these problems. Though RB-EDF performs better than the Linux scheduler in handling soft realtime processes, it can not enforce resource usages smaller than 1 tick(10ms) using the re...